Binary Exponential Back Off for Tabu Tenure in Hyperheuristics

نویسندگان

  • Stephen Remde
  • Keshav P. Dahal
  • Peter I. Cowling
  • Nic Colledge
چکیده

In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) method used in network communication. We compare this method to a reduced Variable Neighbourhood Search (rVNS), greedy and random hyperheuristic approaches and other tabu search based heuristics for a complex real world workforce scheduling problem. Parallelisation is used to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An empirical study of hyperheuristics for managing very large sets of low level heuristics

Hyperheuristics give us the appealing possibility of abstracting the solution method from the problem, since our hyperheuristic, at each decision point, chooses between different low level heuristics rather than different solutions as is usually the case for metaheuristics. By assembling low level heuristics from parameterised components we may create hundreds or thousands of low level heuristi...

متن کامل

Defining Tabu Tenure for the Quadratic Assignment Problem

Tabu search (TS) algorithms are among the most efficient heuristic techniques in combinatorial optimization. Within these algorithms, it is important that the proper policies for maintaining the tabu tenure (tabu list size) are applied. In this paper, we discuss the mechanisms of defining the tabu tenure for the famous combinatorial optimization problem − the quadratic assignment problem (QAP)....

متن کامل

A Dynamic CDMA with Binary Exponential Code (BEC) back-off MAC Protocol in Wireless Networks

IEEE 802.11 wireless media random access protocols uses binary exponential back-off in time domain to coordinate multiple accesses. Every frame must undergo channel contention before transmission which incurs severe inefficiencies in channel utilization in hidden terminal and multi-hop networks because more than 50% of the total time, stations are waiting to gain channel access. Furthermore, th...

متن کامل

Hybrid Binary Exponential Back-Off Mechanism for Wireless Sensor Networks

Many mechanisms to improve the performance have been proposed in the IEEE 802.15.4 Wireless sensor networks area, due to its high influence in the modern day world. Most of them have improved the performance of the network compared to the standard CSMA/CA backoff method. But still there are improvements to almost every method proposed. In this paper, we have proposed a hybrid binary exponential...

متن کامل

Scheduling Nurses Using a Tabu-search Hyperheuristic

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. A number of hyperheuristics have been developed over the past few years. Here we propose a new hyperheuristic framework within which heuristics compete against one another. The rules for competition are motivated by the principles of reinforcement learning. We analyse ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009